A temporal network calculus approach to service guarantee analysis of stochastic networks
نویسندگان
چکیده
Many computer networks such as wireless networks are stochastic in nature. In order to perform performance guarantee analysis of such networks, a theory, called stochastic network calculus, has evolved. In the stochastic network calculus literature, most results are based on space-domain traffic and service models where the arrival process and the service process are respectively characterized by the cumulative amount of arrival and the cumulative amount of service. Recently, a novel approach called time-domain approach to stochastic network calculus (SNC) has been proposed, where the traffic and service models are defined based on the cumulative inter-arrival times and the cumulative service times respectively. In this paper, we concretize the time-domain SNC traffic and service models by linking some well-known stochastic processes to them. In addition, we exemplify the temporal analysis approach by investigating the delay performance of a Gilbert-Elliott channel. The results show that the delay bound can be improved under the independence condition. Furthermore, a comparison between the temporal and the spatial analysis results reveals that the two analytical approaches essentially yield close results.
منابع مشابه
A Temporal Approach to Stochastic Network Calculus
Stochastic network calculus is a newly developed theory for stochastic ser-vice guarantee analysis of computer networks. In the current stochastic net-work calculus literature, its fundamental models are based on the cumulativeamount of traffic or cumulative amount of service. However, there are net-work scenarios where direct application of such models is difficult. This pa...
متن کاملAnalysis of Stochastic Service Guarantees in Communication Networks: A Basic Calculus
A basic calculus is presented for stochastic service guarantee analysis in communication networks. Central to the calculus are two definitions, maximum-(virtual)-backlog-centric (m.b.c) stochastic arrival curve and stochastic service curve, which respectively generalize arrival curve and service curve in the deterministic network calculus framework. With m.b.c stochastic arrival curve and stoch...
متن کاملAnalysis of Stochastic Service Guarantees in Communication Networks: A Server Model
Many communication networks such as wireless networks only provide stochastic service guarantees. For analyzing stochastic service guarantees, research effort has been made in the past few years to develop stochastic network calculus, a probabilistic version of (min, +) deterministic network calculus. However, many challenges have made the development difficult. Some of them are closely related...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملFundamental calculus on generalized stochastically bounded bursty traffic for communication networks
Since many applications and networks do not require or provide deterministic service guarantees, stochastic service guarantee analysis is becoming increasingly important and has attracted a lot of research attention in recent years. For this, several stochastic versions of deterministic traffic models have been proposed in the literature. Unlike previous stochastic models that are based on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011